On a Dispersion Problem in Grid Labeling
نویسندگان
چکیده
منابع مشابه
On a dispersion problem in grid labeling
Given k labelings of a finite d-dimensional cubical grid, define the combined distance between two labels to be the sum of the l1-distance between the two labels in each labeling. We want to construct k labelings which maximize the minimum combined distance between any two labels. When d = 1, this can be interpreted as placing n non-attacking rooks in a k-dimensional chessboard of size n in suc...
متن کاملeffect of sub-grid scales on large eddy simulation of particle deposition in a turbulent channel flow
چکیده ندارد.
15 صفحه اولOn the S-Labeling problem
Let G be a graph of order n and size m. A labeling of G is a bijective mapping θ : V(G) → {1, 2, . . . , n}, and we call Θ(G) the set of all labelings of G. For any graph G and any labeling θ ∈ Θ(G), let SL(G, θ) = ∑ e∈E(G)min{θ(u) : u ∈ e}. In this paper, we consider the S-Labeling problem, defined as follows: Given a graph G, find a labeling θ ∈ Θ(G) that minimizes SL(G, θ). The S-Labeling pr...
متن کاملConnected component labeling on a 2D grid using CUDA
Connected component labeling is an important but computationally expensive operation required in many fields of research. The goal in the present work is to label connected components on a 2D binary map. Two different iterative algorithms for doing this task are presented. The first algorithm (Row–Col Unify) is based upon the directional propagation labeling, whereas the second algorithm uses t...
متن کاملThe Covering Path Problem on a Grid
This paper introduces the covering path problem on a grid (CPPG) which finds the costminimizing path connecting a subset of points in a grid such that each point is within a predetermined distance of a point from the chosen subset. We leverage the geometric properties of the grid graph which captures the road network structure in many transportation problems, including our motivating setting of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2012
ISSN: 0895-4801,1095-7146
DOI: 10.1137/100815281